Eulerian circuits with no monochromatic transitions

نویسندگان

  • James M. Carraher
  • Stephen G. Hartke
چکیده

Let G be an eulerian digraph with a fixed edge coloring (not necessarily a proper edge coloring). A compatible circuit of G is an eulerian circuit such that every two consecutive edges in the circuit have different colors. We characterize the existence of compatible circuits for directed graphs avoiding certain vertices of outdegree three. Our result is analogous to a result of Kotzig for compatible circuits in edge-colored eulerian undirected graphs. From our characterization for digraphs we develop a polynomial time algorithm that determines the existence of a compatible circuit in an edge-colored eulerian digraph and produces a compatible circuit if one exists. Our results use the fact that rainbow spanning trees have been characterized in edge-colored undirected multigraphs. We provide another graph theoretical proof of this fact.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs

Let G be an eulerian digraph with a fixed edge coloring (not necessarily a proper edge coloring). A compatible circuit of G is an eulerian circuit such that every two consecutive edges in the circuit have different colors. We characterize the existence of compatible circuits for directed graphs avoiding certain vertices of outdegree three. Our result is analogous to a result of Kotzig for compa...

متن کامل

Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three

A colored eulerian digraph is an eulerian digraph G where a color is assigned to the tail of each edge and a color is assigned to the head of each edge. A compatible circuit is an eulerian circuit such that for every two consecutive edges uv and vw of the circuit, the color of the head of uv is different from the color of the tail of vw. Let S3 be the set of vertices of outdegree and indegree t...

متن کامل

Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties

Let G be a simple connected graph all of whose vertices have even degrees. An Eulerian circuit in G is a closed walk (see, for example, [2]) which uses every edge of G exactly once. Two Eulerian circuits are called equivalent if one is a cyclic permutation of the other. It is clear that the size of such an equivalence class equals the number of edges of graph G. Let EC(G) denote the number of e...

متن کامل

Finding Hamiltonian circuits in quasi-adjoint graphs

This paper is motivated by a method used for DNA sequencing by hybridization presented in [Jacek Blazewicz, Marta Kasprzak, Computational complexity of isothermic DNA sequencing by hybridization, Discrete Appl. Math. 154 (5) (2006) 718–729]. This paper presents a class of digraphs: the quasi-adjoint graphs. This class includes the ones used in the paper cited above. A polynomial recognition alg...

متن کامل

Asymptotic Enumeration of Eulerian Circuits in the Complete Graph

We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, constrained to use each edge at most once, is taken on Kn, then the probability that all the edges are eventually used is asymptotic to en. Some similar results are obtained about eulerian circuits and spanning trees i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012